Lecturer: Anupam Gupta
نویسندگان
چکیده
In this lecture, we will study a different type of graph cuts than the max-cut problem previously discussed. Let us recall that the maximum-cut problem is to find a 2-coloring of the vertices to maximize the total weight of the edges whose endpoints have different colors. We have seen a simple factor-1/2 approximation in Homework #1, and an SDP-based factor-0.878 approximation in Lecture 14. We also know that the problem is NP-hard. It is natural to wonder what we can say if the objective is instead to minimize the weight. +1 -1
منابع مشابه
Electronic structures and optical properties of some fluorite structured intermetallics
The electromc energy band structures of three interrnetalhc compounds have been
متن کامل37 - IJBMRF20151859 Dr. Arpita Kabiraj
Senior lecturer, Department of Oral Pathology & Microbiology, Haldia Institute of Dental Sciences and Research, Purba Medinipur, Haldia, West Bengal, India -721645. Senior lecturer, Department of Oral Pathology & Microbiology, Sardar Patel Post Graduate Institute of Dental & Medical Sciences, Lucknow, U.P, India Senior lecturer, Department of Oral Medicine & Radiology, Haldia institute of denta...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008